Hiding Quiet Solutions in Random Constraint Satisfaction Problems
نویسندگان
چکیده
We study constraint satisfaction problems on the so-called planted random ensemble. We show that for a certain class of problems, e.g., graph coloring, many of the properties of the usual random ensemble are quantitatively identical in the planted random ensemble. We study the structural phase transitions and the easy-hard-easy pattern in the average computational complexity. We also discuss the finite temperature phase diagram, finding a close connection with the liquid-glass-solid phenomenology.
منابع مشابه
Special Section on Constraint Satisfaction Problems and Message Passing Algorithms
Recent years have seen the emergence of a fascinating cross-disciplinary area at the interface of statistical physics, combinatorial optimization, information theory, and computer science. Many important questions in various branches of science can be formulated as problems of optimization or inference, and the framework of graphical models provides a common language. Topics range from constrai...
متن کاملA Parallelization Framework for Exact Knowledge Hiding in Transactional Databases
The hiding of sensitive knowledge, mined from transactional databases, is one of the primary goals of privacy preserving data mining. The increased storage capabilities of modern databases and the necessity for hiding solutions of superior quality, paved the way for parallelization of the hiding process. In this paper, we introduce a novel framework for decomposition and parallel solving of a c...
متن کاملRandom Formulas Have Frozen Variables
For a large number of random constraint satisfaction problems, such as random k-SAT and random graph and hypergraph coloring, we have very good estimates of the largest constraint density for which solutions exist. Yet, all known polynomial-time algorithms for these problems fail to find solutions even at much lower densities. To understand the origin of this gap one can study how the structure...
متن کاملGenerating Hard Satisfiable Formulas by Hiding Solutions Deceptively
To test incomplete search algorithms for constraint satisfaction problems such as 3-SAT, we need a source of hard, but satisfiable, benchmark instances. A simple way to do this is to choose a random truth assignment A, and then choose clauses randomly from among those satisfied by A. However, this method tends to produce easy problems, since the majority of literals point toward the “hidden” as...
متن کاملQuiet Planting in the Locked Constraint Satisfaction Problems
We study the planted ensemble of locked constraint satisfaction problems. We describe the connection between the random and planted ensembles. The use of the cavity method is combined with arguments from reconstruction on trees and first and second moment considerations; in particular the connection with the reconstruction on trees appears to be crucial. Our main result is the location of the h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Physical review letters
دوره 102 23 شماره
صفحات -
تاریخ انتشار 2009